Cryptographic implications of Hess' generalized GHS attack

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The GHS Attack Revisited

We generalize the Weil descent construction of the GHS attack to arbitrary Artin-Schreier extensions. We give a formula for the characteristic polynomial of Frobenius of the obtained curves and prove that the large cyclic factor of the input elliptic curve is not contained in the kernel of the composition of the conorm and norm maps. As an application we almost square the number of elliptic cur...

متن کامل

An Extension of GHS Weil Descent Attack

The Weil descent attack, suggested by Frey, has been implemented by Gaudry, Hess and Smart (the so-called GHS attack), on elliptic curves over finite fields of characteristic two of composite degrees. The GHS attack has been extended by Galbraith to hyperelliptic curves of characteristic two. Recently, Diem presented a general treatment of GHS attack to hyperelliptic curves over finite fields o...

متن کامل

Extending the GHS Weil Descent Attack

In this paper we extend the Weil descent attack due to Gaudry, Hess and Smart (GHS) to a much larger class of elliptic curves. This extended attack applies to fields of composite degree over F2. The principle behind the extended attack is to use isogenies to find an elliptic curve for which the GHS attack is effective. The discrete logarithm problem on the target curve can be transformed into a...

متن کامل

The GHS Attack for Cyclic Extensions of Arbitrary Function Fields

This paper give a generalization of the GHS attack which is a class of attacks for algebraic curve cryptography, proposed by Pierrick Gaudry, Florian Hess and Nigel P. Smart [GHS]. In the mid of 1980’s, Victor Miller and Neal Koblitz independently proposed elliptic curve cryptography (ECC) which designates the discrete logarithm problem (DLP) in the finite group Fq-rational points of an ellipti...

متن کامل

Protecting Cryptographic Memory against Tampering Attack

In this dissertation we investigate the question of protecting cryptographic devices from tampering attacks. Traditional theoretical analysis of cryptographic devices is based on black-box models which do not take into account the attacks on the implementations, known as physical attacks. In practice such attacks can be executed easily, e.g. by heating the device, as substantiated by numerous w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applicable Algebra in Engineering, Communication and Computing

سال: 2005

ISSN: 0938-1279,1432-0622

DOI: 10.1007/s00200-005-0186-8